A quick search method for multimedia signals using global pruning
نویسندگان
چکیده
あらまし 探したい音や映像が具体的に与えられ,それとほぼ同じ信号の区間が蓄積された長時間の音や映像 の中のどこにあるかを高速に探索する問題に対する新しい手法を提案する.これまでに,高速探索手法の一つと して,時系列アクティブ探索法が提案されている.これは,信号から抽出したヒストグラムに基づく信号探索手 法であり,ローカルな枝刈り,すなわち照合窓周辺の類似度に基づいて探索の必要がない区間の照合を省くこと により高速な探索を実現していた.それに対し,提案手法は,ローカルな枝刈りに加え,信号全体の類似性に基 づくヒストグラムの分類により信号時系列全体を見て探索の必要がない区間を取り除く,グローバルな枝刈りを 導入することにより,更に高速な探索を実現する.本論文では,グローバルな枝刈りの度合と保証される精度と の関係を詳しく議論する.例えば提案手法では,128 次元のヒストグラムを 1024 通りに分類したとき,時系列 アクティブ探索法に比べ,事前処理の計算時間が信号時系列の再生時間の 1%程度増加するものの,同程度の精 度を保ったまま,探索速度を約 9 倍にできることを実験により示す. キーワ ドー 一致探索,時系列アクティブ探索法,グローバルな枝刈り,ヒストグラム重なり率,L2 距離
منابع مشابه
A quick search method for audio and video signals based on histogram pruning
This paper proposes a quick method of similaritybased signal searching to detect and locate a specific audio or video signal given as a query in a stored long audio or video signal. With existing techniques, similarity-based searching may become impractical in terms of computing time in the case of searching through long-running (several-days’ worth of) signals. The proposed algorithm, which is...
متن کاملVery quick audio searching: introducing global pruning to the Time-Series Active Search
Previously, we proposed a histogram-based quick signal search method called Time-Series Active Search (TAS). TAS is a method of searching through long audio or video recordings for a specified segment, based on signal similarity. TAS is fast; it can search through a 24-hour recording in 1 second after a query-independent preprocessing. However, an even faster method is required when we consider...
متن کاملOPTIMUM DESIGN OF DOUBLE CURVATURE ARCH DAMS USING A QUICK HYBRID CHARGED SYSTEM SEARCH ALGORITHM
This paper presents an efficient optimization procedure to find the optimal shapes of double curvature arch dams considering fluid–structure interaction subject to earthquake loading. The optimization is carried out using a combination of the magnetic charged system search, big bang-big crunch algorithm and artificial neural network methods. Performing the finite element analysis dur...
متن کاملScalable Duplicate Pruning Strategies for Parallel A* Graph Search
In parallel A * graph search on distributed-memory machines, different processors may perform significant duplicated work if inter-processor duplicates are not pruned. The only known method for duplicate pruning associates a particular processor with each distinct node of the search space using a suitable hash function. Then duplicate nodes arising in different processors are transmitted to the...
متن کاملدانشنامههای الکترونیکی: مفاهیم، مزایا و معایب
Purpose: Electronic encyclopedia is a novel phenomenon emerged in information system. This study aims to study the concepts, advantages, and disadvantages of electronic encyclopedias. In addition, we introduce three well-known electronic encyclopedias. Methodology: This research has used the methodology of library studies and search in internet. Findings: The results indicate that the most si...
متن کاملModify the linear search formula in the BFGS method to achieve global convergence.
<span style="color: #333333; font-family: Calibri, sans-serif; font-size: 13.3333px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: justify; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: #ffffff; text-dec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Systems and Computers in Japan
دوره 34 شماره
صفحات -
تاریخ انتشار 2003